Rearrangement of DNA fragments: a branch-and-cut algorithm
نویسندگان
چکیده
منابع مشابه
Rearrangement of DNA fragments: a branch-and-cut algorithm
In this paper we consider a problem that arises in the process of reconstruction of DNA fragments. We present a graph theoretical formulation of the problem and mention some extensions. We show this problem to be NP-hard. A 0-1 integer linear programming formulation of the problem is given and some preliminary results of a branch-and-cut algorithm based on this formulation are discussed. 1 We t...
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولA Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of the 0/1-polytope associated with it. Based on these theoretical results, we present now a Branch-and-Cut algorithm for the graph coloring problem. Our computational experiences compare favorably with the well-known ex...
متن کاملA Branch-and-cut Algorithm for Integer Bilevel Linear Programs
We describe a rudimentary branch-and-cut algorithm for solving integer bilevel linear programs that extends existing techniques for standard integer linear programs to this very challenging computational setting. The algorithm improves on the branch-and-bound algorithm of Moore and Bard in that it uses cutting plane techniques to produce improved bounds, does not require specialized branching s...
متن کاملA branch-and-cut algorithm for the preemptive swapping problem
In the Swapping Problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determining a minimum cost route that allows the vehicle to satisfy every supply and demand. This article investigates t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00324-3